Analysis of parallel algorithms - PDFSEARCH.IO - Document Search Engine

Analysis of parallel algorithms
Results: 94

#	Item
31	Dancing with Uncertainty Sasa Misailovic Stelios Sidiroglou Martin C. Rinard Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-02-03 11:11:36 Parallel computing Compiler optimizations Analysis of parallel algorithms Automatic parallelization Speedup Reliability engineering Algorithm Floating point Thread
32	Run and Be Safe: Mixed-Criticality Scheduling with Temporary Processor Speedup Pengcheng Huang, Pratyush Kumar, Georgia Giannopoulou, Lothar Thiele Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, S Add to Reading List Source URL: www.tik.ethz.ch Language: English - Date: 2014-11-29 11:41:05 Computing Engineering Technology Analysis of parallel algorithms Parallel computing Speedup Real-time computing Mixed criticality Worst-case execution time Scalability
33	Run and Be Safe: Mixed-Criticality Scheduling with Temporary Processor Speedup TIK Report No. 357 Pengcheng Huang, Pratyush Kumar, Georgia Giannopoulou, Lothar Thiele Computer Engineering and Networks Laboratory, ETH Zur Add to Reading List Source URL: www.tik.ethz.ch Language: English - Date: 2014-12-16 07:11:40 Real-time computing Analysis of parallel algorithms Scheduling Computing Speedup Technology Worst-case execution time Task
34	Communication Optimal Parallel Multiplication of Sparse Random Matrices∗ Grey Ballard Aydın Buluç Add to Reading List Source URL: gauss.cs.ucsb.edu Language: English - Date: 2013-05-20 18:41:58 Multiplication Matrix theory Numerical linear algebra Matrix multiplication algorithm Analysis of algorithms Computational complexity theory Matrix multiplication Matrix Parallel computing Multiplication algorithm Algorithm Time complexity
35	PDF Document Add to Reading List Source URL: gauss.cs.ucsb.edu Language: English - Date: 2013-01-08 14:42:12 Algebra Mathematics Linear algebra Numerical linear algebra Parallel computing Multiplication Matrix theory Matrix multiplication algorithm Analysis of algorithms Matrix multiplication Matrix Basic Linear Algebra Subprograms
36	S OME R ESEARCH T OPICS FOR S TUDENTS Quentin F. Stout Here’s a quick overview of some research topics I’m interested in. I’ve also worked with many students that initiated their own project. If yo Add to Reading List Source URL: web.eecs.umich.edu Language: English - Date: 2015-03-12 12:55:51 Parallel computing Spanning tree Analysis of algorithms Search algorithms Parallel algorithm Algorithm Genetic algorithm Parallel Random Access Machine Minimum spanning tree Theoretical computer science Concurrent computing Applied mathematics
37	Oblivious Algorithms for Multicores and Network of Processors ? Rezaul Alam Chowdhury1 , Francesco Silvestri2 , Brandon Blakeley1 , and Vijaya Ramachandran1 1 Add to Reading List Source URL: www.itu.dk Language: English - Date: 2015-01-07 05:01:32 Computer hardware Analysis of algorithms Applied mathematics Cache-oblivious algorithm Digital signal processing CPU cache Cache algorithms Parallel computing Algorithm Cache Computing Computer memory
38	Cache-Oblivious Simulation of Parallel Programs Andrea Pietracaprina, Geppino Pucci, and Francesco Silvestri Department of Information Engineering, University of Padova, Italy {capri,geppo,silvest1}@dei.unipd.it Abstrac Add to Reading List Source URL: www.itu.dk Language: English - Date: 2015-01-07 05:01:30 Analysis of algorithms Cache Computer memory Computational complexity theory Cache-oblivious algorithm CPU cache Fast Fourier transform Time complexity Parallel computing Theoretical computer science Applied mathematics Mathematics
39	Cache-Oblivious Simulation of Parallel Programs Andrea Pietracaprina Geppino Pucci Francesco Silvestri Add to Reading List Source URL: www.itu.dk Language: English - Date: 2015-01-07 05:01:28 Models of computation Analysis of algorithms Cache-oblivious algorithm CPU cache Locality of reference Parallel computing Cache Computer memory Computing
40	Space-Efficient Parallel Algorithms for Combinatorial Search Problems? A. Pietracaprina1 , G. Pucci1 , F. Silvestri1 , and F. Vandin2 1 University of Padova, Dip. Ingegneria dell’Informazione, Padova, Italy Add to Reading List Source URL: www.itu.dk Language: English - Date: 2015-01-07 05:01:30 Computational complexity theory Analysis of algorithms Tree traversal Tree B-tree Rope Time complexity Randomized algorithm Binary search tree Theoretical computer science Binary trees Graph theory

UPDATE